Probability unfolding, 1965‒2015
نویسندگان
چکیده
منابع مشابه
Probability of observing a number of unfolding events while stretching polyproteins.
The mechanical stretching of single polyproteins is an emerging tool for the study of protein (un)folding, chemical catalysis and polymer physics at the single molecule level. The observed processes, i.e., unfolding or reduction events, are typically considered to be stochastic and by nature are susceptible to be censored by the finite duration of the experiment. A formal analytical and experim...
متن کاملUnfolding CSP
A little history shows something of these different approaches. Around 1979 we first discovered our complementary interests in concurrency. Tony at first expressed his ideas through the medium of a programming language [6], and I through a prototypical algebraic theory [8]. The difference became plainer as time went on. Tony was keen to find a single formalism in which specifications of concurr...
متن کاملUnfolding Density
In this note we outline a procedure for determining the mass density of material surrounding the muon detector by comparing measured muon fluxes with reference or background data-sets and adjusting a set of parameters which describe the density to achieve a best overall agreement between signal and background fluxes. Information on muon fluxes is stored in “data-cubes” which are histograms givi...
متن کاملSlow Unfolding of Monomeric Proteins from Hyperthermophiles with Reversible Unfolding
Based on the differences in their optimal growth temperatures microorganisms can be classified into psychrophiles, mesophiles, thermophiles, and hyperthermophiles. Proteins from hyperthermophiles generally exhibit greater stability than those from other organisms. In this review, we collect data about the stability and folding of monomeric proteins from hyperthermophilies with reversible unfold...
متن کاملUnfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm
We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely, given an orthogonal polyhedron with n vertices, the algorithm cuts the polyhedron only where it is met by the grid of coordinate planes passing through the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2016
ISSN: 0001-8678,1475-6064
DOI: 10.1017/apr.2016.39